Weighted earliness/tardiness parallel machine scheduling problem with a common due date

This paper investigates an unrelated parallel machine scheduling problem with a restrictive common due date. The objective is to minimize the total sum of earliness/tardiness costs. Using some properties such as V-Shaped property, optimizing start times machines, and no idle time between successive jobs, we propose effective construction-based heuristics local search algorithms for problem. variants shortest longest processing dispatching rules job assignment patterns, four different construction have balanced number jobs or workload per machine. We construct deterministic one stochastic solution improvement heuristic approaches using swap reinsertion mechanisms. In proposed reinsertion-based mechanism, V-shaped property each used effectively determine proper positions in which removed inserted. After both operators, preserving mechanism takes place preserve also use LP formulation our optimum machines given schedule. compare against metaheuristics, namely simulated annealing, genetic algorithm, artificial bee colony fast ruin recreate algorithm. A simple lower bound optimal function value show efficiency heuristics. test identical environment. experimental study reveals that methods including outperform metaheuristics other quality environments.